TFP-growth: An Efficient Algorithm for Mining Frequent Patterns without any Thresholds
نویسندگان
چکیده
Conventional frequent pattern mining algorithms require some user-specified minimum support, and then mine frequent patterns with support values that are higher than the minimum support. As it is difficult to predict how many frequent patterns will be mined with a specified minimum support, the Top-k mining concept has been proposed. The Top-k Mining concept is based on an algorithm for mining frequent patterns without a minimum support, but with the number of most k frequent patterns ordered according to their support values. However, the Top-k mining concept still requires a threshold k. Therefore, users must decide the value of k before initiating mining. In this paper, we propose a new mining algorithm, called “TFP-growth,” which does not require any thresholds. This algorithm mines patterns with the descending order of their support values without any thresholds and returns frequent patterns to users sequentially with short response time.
منابع مشابه
Mining Top-K Frequent Closed Patterns without Minimum Support
In this paper, we propose a new mining task: mining top-k frequent closed patterns of length no less than min `, where k is the desired number of frequent closed patterns to be mined, and min ` is the minimal length of each pattern. An efficient algorithm, called TFP, is developed for mining such patterns without minimum support. Two methods, closed node count and descendant sum are proposed to...
متن کاملDiscovering Periodic-Frequent Patterns in Transactional Databases
Since mining frequent patterns from transactional databases involves an exponential mining space and generates a huge number of patterns, efficient discovery of user-interest-based frequent pattern set becomes the first priority for a mining algorithm. In many real-world scenarios it is often sufficient to mine a small interesting representative subset of frequent patterns. Temporal periodicity...
متن کاملFrequent Pattern Mining under Multiple Support Thresholds
Traditional methods use a single minimum support threshold to find out the complete set of frequent patterns. However, in real word applications, using single minimum item support threshold is not adequate since it does not reflect the nature of each item. If single minimum support threshold is set too low, a huge amount of patterns are generated including uninteresting patterns. On the other h...
متن کاملNovel Techniques to Reduce Search Space in Periodic-Frequent Pattern Mining
Periodic-frequent patterns are an important class of regularities that exist in a transactional database. Informally, a frequent pattern is said to be periodic-frequent if it appears at a regular interval specified by the user (i.e., periodically) in a database. A pattern-growth algorithm, called PFP-growth, has been proposed in the literature to discover the patterns. This algorithm constructs...
متن کاملFast Algorithms for Mining Interesting Frequent Itemsets without Minimum Support
Real world datasets are sparse, dirty and contain hundreds of items. In such situations, discovering interesting rules (results) using traditional frequent itemset mining approach by specifying a user defined input support threshold is not appropriate. Since without any domain knowledge, setting support threshold small or large can output nothing or a large number of redundant uninteresting res...
متن کامل